Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets
نویسندگان
چکیده
We investigate a class of nominal algebraic Henkin-style models for the simply typed λ calculus in which variables map to names in the denotation and λ -abstraction maps to a (non-functional) name-abstraction operation. The resulting denotations are smaller and better-behaved, in ways we make precise, than functional valuation-based models. Using these new models, we then develop a generalisation of λ -term syntax enriching them with existential meta-variables, thus yielding a theory of incomplete functions. This incompleteness is orthogonal to the usual notion of incompleteness given by function abstraction and application, and corresponds to holes and incomplete objects.
منابع مشابه
A theory of program refinement
We give a canonical program refinement calculus based on the lambda calculus and classical first-order predicate logic, and study its proof theory and semantics. The intention is to construct a metalanguage for refinement in which basic principles of program development can be studied. The idea is that it should be possible to induce a refinement calculus in a generic manner from a programming ...
متن کاملA Characterization of lambda Definability in Categorical Models of Implicit Polymorphism
Lambda deenability is characterized in categorical models of simply typed lambda calculus with type variables. A category-theoretic framework known as glueing or sconing is used to extend the Jung-Tiuryn characterization of lambda deenability JuT93], rst to ccc models, and then to categorical models of the calculus with type variables. Logical relations are now a well-established tool for study...
متن کاملNominal Algebra and the HSP Theorem
Nominal algebra is a logic of equality developed to reason algebraically in the presence of binding. In previous work it has been shown how nominal algebra can be used to specify and reason algebraically about systems with binding, such as first-order logic, the lambda-calculus, or process calculi. Nominal algebra has a semantics in nominal sets (sets with a finitely-supported permutation actio...
متن کاملRepresentation and duality of the untyped lambda-calculus in nominal lattice and topological semantics, with a proof of topological completeness
We give a semantics for the λ-calculus based on a topological duality theorem in nominal sets. A novel interpretation of λ is given in terms of adjoints, and λ-terms are interpreted absolutely as sets (no valuation is necessary).
متن کاملReconciling positional and nominal binding
We define an extension of the simply-typed lambda-calculus where two different binding mechanisms, by position and by name, nicely coexist. In the former, as in standard lambda-calculus, the matching between parameter and argument is done on a positional basis, hence α-equivalence holds, whereas in the latter it is done on a nominal basis. The two mechanisms also respectively correspond to stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011